Checking Strong Open Congruence in χ-Calculus
نویسندگان
چکیده
منابع مشابه
On the Bisimulation Congruence in χ-Calculus
In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under contex...
متن کاملStuttering Congruence for χ
The language χ is a modeling and simulation language which is currently mainly used to analyse and optimize the performance of industrial systems. To be able to also verify functional properties of a system using a χ model, part of the language has been given a formal semantics. Rather than implementing a new model checker for χ, the philosophy is to provide automatic translations from χ into t...
متن کاملChecking π-Calculus Structural Congruence is Graph Isomorphism Complete
We show that the problems of checking π-Calculus structural congruence (πSC) and graph isomorphism (GI) are Karp reducible to each other. The reduction from GI to πSC is given explicitly, and the reduction in the opposite direction proceeds by transforming πSC into an instance of the term equality problem (i.e., the problem of deciding equivalence of two terms in the presence of associative and...
متن کاملBisimulation congruence of chi calculus
Chi calculus was proposed as a process calculus that has a uniform treatment of names. Preliminary properties of chi calculus have been examined in literature. In this paper a more systematic study of bisimilarities for chi processes is carried out. The notion of L-bisimilarity is introduced to give a possible classification of bisimilarities on chi processes. It is shown that the set of L-bisi...
متن کاملCharacterizing Bisimulation Congruence in the {Calculus
This paper presents a new characterization of the bisimulation congruence and D{bisimulation equivalences of the {calculus. The characterization supports a bisimulation{like proof technique which avoids explicit case analysis by taking a dynamic point of view of actions a process may perform , thus providing a new way of proving bisimulation congruence. The semantic theory of the {calculus is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.003